Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
نویسنده
چکیده
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent classical disjunctive logic programs under the respective semantics. Thus, existing technology for classical disjunctive logic programming can be used to implement manyvalued disjunctive logic programming. Using these results on unfolding manyvaluedness, we then give many-valued fixpoint characterizations for the set of all minimal models and the least model state. We also describe an iterative fixpoint characterization for the perfect model semantics under finite local stratification.
منابع مشابه
Many-Valued First-Order Logics with Probabilistic Semantics
We present n-valued rst-order logics with a purely proba-bilistic semantics. We then introduce a new probabilistic semantics of n-valued rst-order logics that lies between the purely probabilistic semantics and the truth-functional semantics of the n-valued Lukasiewicz logics Ln. Within this semantics, closed formulas of classical rst-order logics that are logically equivalent in the classical ...
متن کاملProbabilistic and Truth-Functional Many-Valued Logic Programming
We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...
متن کاملCharacterizations of the Stable Semanticsby Partial
There are three most prominent semantics deened for certain subclasses of disjunctive logic programs: GCWA (for positive programs), PERFECT (for stratiied programs) and STABLE (deened for the whole class of all disjunctive programs). While there are various competitors based on 3-valued models, notably WFS and its disjunctive counterparts, there are no other semantics consisting of 2-valued mod...
متن کاملMany-valued Logic Programming and Fixpoint Semantics for Higher-order Herbrand Models
In this paper we compare the two versions of knowledge invariant transformations of the original Many-valued logic programs: the strict Annotated logic programs and the ’meta’ logic programs obtained by the ontological encapsulation [1]. We show that the first one has the higher-order Herbrand interpretations, while the last can be seen as the flattening of the first one. These two knowledge in...
متن کاملLevel mapping characterizations for quantitative and disjunctive logic programs
Several different approaches of logic programming semantics have been proposed during the last two decades. These semantics varied in many aspects and it was difficult to find the exact relationships between them. Hitzler and Wendt proposed a new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. They gave new characteri...
متن کامل